Galois groups of Mori trinomials and hyperelliptic curves with big monodromy
نویسندگان
چکیده
منابع مشابه
Most Hyperelliptic Curves Have Big Monodromy
ρf,` : Gal(k̄/k)→ Aut(Jf [`](k̄)) ' GL2g(F`) on the `-torsion points of Jf is as big as possible for almost all primes `, if the following two (sufficient) conditions hold: (1) the endomorphism ring of Jf is Z; (2) for some prime ideal p ⊂ Zk, the fiber over p of the Néron model of Cf is a smooth curve except for a single ordinary double point. These conditions can be translated concretely in ter...
متن کاملHyperelliptic Jacobians and Projective Linear Galois Groups
In [9] the author proved that in characteristic 0 the jacobian J(C) = J(Cf ) of a hyperelliptic curve C = Cf : y 2 = f(x) has only trivial endomorphisms over an algebraic closure Ka of the ground field K if the Galois group Gal(f) of the irreducible polynomial f ∈ K[x] is “very big”. Namely, if n = deg(f) ≥ 5 and Gal(f) is either the symmetric group Sn or the alternating group An then the ring ...
متن کاملMonodromy Groups of Coverings of Curves
We consider nite separable coverings of curves f : X → Y over a eld of characteristic p ≥ 0. We are interested in describing the possible monodromy groups of this cover if the genus of X is xed. There has been much progress on this problem over the past decade in characteristic zero. Recently Frohardt and Magaard completed the nal step in resolving the Guralnick Thompson conjecture showing that...
متن کاملGalois theory of special trinomials
This is the material which I presented at the 60th birthday conference of my good friend José Luis Vicente in Seville in September 2001. It is based on the nine lectures, now called sections, which were given by me at Purdue in Spring 1997. This should provide a good calculational background for the Galois theory of vectorial (= additive) polynomials and their iterates.
متن کاملHyperelliptic Curves and Cryptography
In 1989, Koblitz proposed using the jacobian of a hyperelliptic curve defined over a finite field to implement discrete logarithm cryptographic protocols. This paper provides an overview of algorithms for performing the group law (which are necessary for the efficient implementation of the protocols), and algorithms for solving the hyperelliptic curve discrete logarithm problem (whose intractab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Mathematics
سال: 2015
ISSN: 2199-675X,2199-6768
DOI: 10.1007/s40879-015-0048-2